Controllability and observability analysis for vertex domination centrality in directed networks
نویسندگان
چکیده
منابع مشابه
Controllability and observability analysis for vertex domination centrality in directed networks
Topological centrality is a significant measure for characterising the relative importance of a node in a complex network. For directed networks that model dynamic processes, however, it is of more practical importance to quantify a vertex's ability to dominate (control or observe) the state of other vertices. In this paper, based on the determination of controllable and observable subspaces un...
متن کاملControllability and observability of Boolean control networks
The controllability and observability of Boolean control networks are investigated. After a brief review on converting a logic dynamics to a discrete-time linear dynamics with a transition matrix, some formulas are obtained for retrieving network and its logical dynamic equations from this network transitionmatrix. Based on the discrete-time dynamics, the controllability via two kinds of inputs...
متن کاملMeasuring domination in directed networks
Dominance relations between individuals can be represented by a directed social network. A relational power measure is a function that assigns to each position in a directed network a value representing the relational power of that position in the network. We axiomatically characterize two such power measures, the b-measure and the score-measure. We also apply these measures to weighted directe...
متن کاملON CONTROLLABILITY AND OBSERVABILITY OF FUZZY CONTROL SYSTEMS
In order to more effectively cope with the real world problems of vagueness, imprecise and subjectivity, fuzzy event systems were proposed recently. In this paper, we investigate the controllability and the observability property of two systems that one of them has fuzzy variables and the other one has fuzzy coefficients and fuzzy variables (fully fuzzy system). Also, sufficient conditions for ...
متن کاملDirected domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2014
ISSN: 2045-2322
DOI: 10.1038/srep05399